A Simulink model for modified fountain codes
نویسندگان
چکیده
This paper introduces a Simulink model design for modified fountain code. The code is new version of the traditional Luby transform (LT) codes. constructs blocks required generation generator matrix limited-degree-hopping-segment (LDHS-LT) especially designed short length data files which have assigned great interest wireless sensor networks. It generates degrees in predetermined sequence but random and partitioned file segments. packets selection has been made serialy according to integer generated from both degree segment generators. tested using Monte Carlo simulation approach with conventional robust soliton distribution (RSD) generation, results approve better performance all testing parameter.
منابع مشابه
Fountain Codes
Fountain codes are record-breaking sparse-graph codes for channels with erasures – such as the internet, where files are transmitted in multiple small packets, each of which is either received without error or not received. Standard file-transfer protocols simply chop a file up into K packet-sized pieces, then repeatedly transmit each packet until it is successfully received. A back-channel is ...
متن کاملCorruption Resilient Fountain Codes
A new aspect for erasure coding is considered, namely, the possibility that some portion of the arriving packets are corrupted in an undetectable fashion. In practice, the corrupted packets may be attributed to a portion of the communication paths that are leading to the receiver and are controlled by an adversary. Alternatively, in case packets are collected from several sources, the corruptio...
متن کاملLinearly-Coupled Fountain Codes
Network-coded multiple access (NCMA) is a communication scheme for wireless multiple-access networks where physical-layer network coding (PNC) is employed. In NCMA, a user encodes and spreads its message into multiple packets. Time is slotted and multiple users transmit packets (one packet each) simultaneously in each timeslot. A sink node aims to decode the messages of all the users from the s...
متن کاملFountain codes for lossless data compression
This paper proposes a universal variable-length lossless compression algorithm based on fountain codes. The compressor concatenates the Burrows-Wheeler block sorting transform (BWT) with a fountain encoder, together with the closed-loop iterative doping algorithm. The decompressor uses a Belief Propagation algorithm in conjunction with the iterative doping algorithm and the inverse BWT. Linear-...
متن کاملFountain Codes and Invertible Matrices
This paper deals with Fountain codes, and especially with their encoding matrices, which are required here to be invertible. A result is stated that an encoding matrix induces a permutation. Also, a result is that encoding matrices form a group with multiplication operation. An encoding is a transformation, which reduces the entropy of an initially high-entropy input vector. A special encoding ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: TELKOMNIKA Telecommunication Computing Electronics and Control
سال: 2023
ISSN: ['1693-6930', '2302-9293']
DOI: https://doi.org/10.12928/telkomnika.v21i1.23274